翻訳と辞書 Words near each other ・ Fibes Drums ・ Fibes, Oh Fibes! ・ Fibex ・ Fibiger (crater) ・ Fibigia ・ Fibigia clypeata ・ Fibis ・ Fibiș ・ Fibiș River ・ Fibla carpenteri ・ FIBO Power Pro Germany ・ Fibonacci ・ Fibonacci coding ・ Fibonacci cube ・ Fibonacci heap ・ Fibonacci number ・ Fibonacci numbers in popular culture ・ Fibonacci polynomials ・ Fibonacci prime ・ Fibonacci Quarterly ・ Fibonacci quasicrystal ・ Fibonacci retracement ・ Fibonacci search technique ・ Fibonacci word ・ Fibonacci's identity ・ Fibonomial coefficient ・ Fibonorial ・ Fiborgtangen ・ FIBP ・ Fibra Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Fibonacci number ： ウィキペディア英語版 Fibonacci number In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence: :$1,\backslash ;1,\backslash ;2,\backslash ;3,\backslash ;5,\backslash ;8,\backslash ;13,\backslash ;21,\backslash ;34,\backslash ;55,\backslash ;89,\backslash ;144,\backslash ;\; \backslash ldots\backslash ;$ or (often, in modern usage): :$0,\backslash ;1,\backslash ;1,\backslash ;2,\backslash ;3,\backslash ;5,\backslash ;8,\backslash ;13,\backslash ;21,\backslash ;34,\backslash ;55,\backslash ;89,\backslash ;144,\backslash ;\; \backslash ldots\backslash ;$ . By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence ''Fn'' of Fibonacci numbers is defined by the recurrence relation :$F\_n\; =\; F\_\; +\; F\_,\backslash !\backslash ,$ with seed values :$F\_1\; =\; 1,\backslash ;\; F\_2\; =\; 1$ or :$F\_0\; =\; 0,\backslash ;\; F\_1\; =\; 1.$ The Fibonacci sequence is named after Italian mathematician Fibonacci. His 1202 book ''Liber Abaci'' introduced the sequence to Western European mathematics, although the sequence had been described earlier in Indian mathematics.〔〔〔 By modern convention, the sequence begins either with ''F''0 = 0 or with ''F''1 = 1. The ''Liber Abaci'' began the sequence with ''F''1 = 1. Fibonacci numbers are closely related to Lucas numbers $L\_n$ in that they form a complementary pair of Lucas sequences $U\_n(1,-1)=F\_n$ and $V\_n(1,-1)=L\_n$. They are intimately connected with the golden ratio; for example, the closest rational approximations to the ratio are 2/1, 3/2, 5/3, 8/5, ... . Applications include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems. They also appear in biological settings, such as branching in trees, phyllotaxis (the arrangement of leaves on a stem), the fruit sprouts of a pineapple, the flowering of an artichoke, an uncurling fern and the arrangement of a pine cone's bracts. ==Origins== The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody. In the Sanskrit tradition of prosody, there was interest in enumerating all patterns of long (L) syllables that are 2 units of duration, and short (S) syllables that are 1 unit of duration. Counting the different patterns of L and S of a given duration results in the Fibonacci numbers: the number of patterns that are ''m'' short syllables long is the Fibonacci number ''F''''m'' + 1. Susantha Goonatilake writes that the development of the Fibonacci sequence "is attributed in part to Pingala (200 BC), later being associated with Virahanka (c. 700 AD), Gopāla (c. 1135), and Hemachandra (c. 1150)". Parmanand Singh cites Pingala's cryptic formula ''misrau cha'' ("the two are mixed") and cites scholars who interpret it in context as saying that the cases for ''m'' beats (''F''''m+1'') is obtained by adding a () to ''F''''m'' cases and () to the ''F''''m''−1 cases. He dates Pingala before 450 BC. However, the clearest exposition of the series arises in the work of Virahanka (c. 700 AD), whose own work is lost, but is available in a quotation by Gopala (c. 1135): : Variations of two earlier meters (the variation )... For example, for (meter of length ) four, variations of meters of two () three being mixed, five happens. (out examples 8, 13, 21 )... In this way, the process should be followed in all ''mātrā-vṛttas'' (combinations ). The series is also discussed by Gopala (before 1135 AD) and by the Jain scholar Hemachandra (c. 1150). Outside of India, the Fibonacci sequence first appears in the book ''Liber Abaci'' (1202) by Leonardo of Pisa, known as Fibonacci. Fibonacci considers the growth of an idealized (biologically unrealistic) rabbit population, assuming that: a newly born pair of rabbits, one male, one female, are put in a field; rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits; rabbits never die and a mating pair always produces one new pair (one male, one female) every month from the second month on. The puzzle that Fibonacci posed was: how many pairs will there be in one year? * At the end of the first month, they mate, but there is still only 1 pair. * At the end of the second month the female produces a new pair, so now there are 2 pairs of rabbits in the field. * At the end of the third month, the original female produces a second pair, making 3 pairs in all in the field. * At the end of the fourth month, the original female has produced yet another new pair, the female born two months ago produces her first pair also, making 5 pairs. At the end of the ''n''th month, the number of pairs of rabbits is equal to the number of new pairs (which is the number of pairs in month ''n'' − 2) plus the number of pairs alive last month (''n'' − 1). This is the ''n''th Fibonacci number. The name "Fibonacci sequence" was first used by the 19th-century number theorist Édouard Lucas. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Fibonacci number」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.